Protecting regular polygons
نویسنده
چکیده
The minimum number of mutually non-overlapping congruent copies of a convex body K so that they can touch K and prevent any other congruent copy of K from touching K without overlapping each other is called the protecting number of K. In this paper we prove that the 1 2 Arnfried Kemnitz, LL aszll o Szabb o, Zoltt an Ujvv ary-Menyhh art protecting number of any regular polygon is three or four, and both values are indeed attained.
منابع مشابه
Affinely regular polygons in an affine plane
In this paper we survey results about affinely regular polygons. First, the definitions and classification of affinely regular polygons are given. Then the theory of Bachmann–Schmidt is outlined. There are several classical theorems about regular polygons, some of them having analogues in finite planes, such as the Napoleon–Barlotti theorem. Such analogues, variants of classical theorems are al...
متن کاملA Higman-Haemers Inequality for Thick Regular Near Polygons
In this note we will generalize the Higman-Haemers inequalities for generalized polygons to thick regular near polygons.
متن کاملThe Regular Near Polygons of Order ( s , 2 )
In this note we classify the regular near polygons of order (s, 2).
متن کاملDetecting all regular polygons in a point set
In this paper, we analyze the time complexity of nding regular polygons in a set of n points. We combine two di erent approaches to nd regular polygons, depending on their number of edges. Our result depends on the parameter α, which has been used to bound the maximum number of isosceles triangles that can be formed by n points. This bound has been expressed as O(n ), and the current best value...
متن کاملWhere to build a temple, and where to dig to find one
In this paper, we analyze the time complexity of finding regular polygons in a set of n points. We use two different approaches to find regular polygons, depending on their number of edges. Those with o(n) edges are found by sweeping a line through the set of points, while the larger polygons are found by random sampling. We can find all the polygons with high probability in O(n ) expected time...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007